The Domain Reduction Method: High Way Reduction in Three Dimensions and Convergence with Inexact Solvers
نویسندگان
چکیده
We study a method for parallel solution of elliptic partial di erential equations which decomposes the problem into a number of independent subproblems on subspaces of the underlying solution space. Using symmetries of the domain, we obtain up to 64 such subproblems for a 3 dimensional cube and the method reduces to a direct solver. In the general case, or when the subproblems are solved only approximately, the method becomes an iterative method or can be used as a preconditioner. Bounds on the resulting convergence factors and condition numbers are given.
منابع مشابه
Inexact additive Schwarz solvers for hp-FEM discretizations in three dimensions
In this paper, a boundary value problem of second order in three space dimensions is discretized by means of the hp-version of the finite element method. The system of linear algebraic equations is solved by the preconditioned conjugate gradient method with an overlapping domain decomposition preconditioner with inexact subproblem solvers. In addition to a global solver for the low order functi...
متن کاملPerformance of Nonlinear Finite-Difference Poisson-Boltzmann Solvers.
We implemented and optimized seven finite-difference solvers for the full nonlinear Poisson-Boltzmann equation in biomolecular applications, including four relaxation methods, one conjugate gradient method, and two inexact Newton methods. The performance of the seven solvers was extensively evaluated with a large number of nucleic acids and proteins. Worth noting is the inexact Newton method in...
متن کاملGlobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملAn inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملArtifact reduction techniques in Cone Beam Computed Tomography (CBCT) imaging modality
Introduction: Cone beam computed tomography (CBCT) was introduced and became more common based on its low cost, fast image procedure rate and low radiation dose compared to CT. This imaging modality improved diagnostic and treatment-planning procedures by providing three-dimensional information with greatly reduced level of radiation dose compared to 2D dental imaging modalitie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997